A Universal Randomized Packet Scheduling Algorithm
نویسندگان
چکیده
منابع مشابه
MSMPS Packet Scheduling Algorithm for VOQ Switches
In this paper we present Maximal Size Matching with Permanent Selection (MSMPS) algorithm [1] which is responsibilities for circuit switching control. We discussed the general algorithm rules and circuit switching architecture which was used in our research. This switch architecture uses Virtual Output Queues (VOQ) for buffering incoming packets. MSMPS algorithm based on permanent connections b...
متن کاملPacket Scheduling Algorithm with Weight Optimization
Abstract: In this paper we present a scheduling algorithm for traffic allocation. In our model, we use a flat pricing scenario in which the weights of the queues are updated using revenue as a target function. Due to the algorithm’s closed form nature, it is capable of operating in non-stationary environments. In addition, the algorithm is nonparametric and deterministic in the sense that any a...
متن کاملPacket Scheduling Algorithm for Wireless Video Streaming
We propose a class of packet scheduling algorithms for video streaming over wireless channels by applying different deadline thresholds to video packets (VP) with different importance. The importance of a VP is determined by its relative position within its group of pictures (GOP) and motion-texture context. We assume wireless channels with fixed round trip time, and with a feedback channel ava...
متن کاملA-MWM: A Low Complexity Packet-Mode Scheduling Algorithm
In a packet switching system, arriving packets have variable lengths. They are segmented into fixed size cells before being switched. In packet-mode scheduling, cells from a packet should be delivered contiguously. Even though fixed-size cell scheduling has been well studied, packet-mode scheduling has more advantages: it has a lower implementation cost and higher throughput. In this paper, we ...
متن کاملA Randomized Algorithm for Flow Shop Scheduling
Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop scheduling where the number of machines is part of the input problem. Our algorithm has a multiplicative factor of 2(1 + δ) and an additive term of O(m ln(m+ n)pmax)/δ ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9700-0